Fair Resource Allocation in Hybrid Network Gateways with Per-Flow Queueing
نویسندگان
چکیده
In this paper, we present an e cient resource allocation scheme for scheduling and bu er management in a bottleck hybrid internet gateway. We use Fair Queueing in conjunction with Probabilistic Fair Drop, a new bu er management policy, to allocate bandwidth and bu er space in the gateway to ensure that all TCP ows threading the gateway achieve high end-to-end throughput and fair service. We propose the use of bu er dimensioning to alleviate the inherent bias of the TCP algorithm towards connections with large Round Trip Time and validate our scheme through simulations.
منابع مشابه
Issues in Resource Allocation and Design of Hybrid
Title of Thesis: ISSUES IN RESOURCE ALLOCATION AND DESIGN OF HYBRID GATEWAYS Degree candidate: Ravichander Vaidyanathan Degree and year: Master of Science, 1999 Thesis directed by: Professor John S. Baras Department of Electrical and Computer Engineering Considerable attention has been focussed on active queue management and fair resource allocation techniques in the Internet. However, few real...
متن کاملVLSI implementation of a fairness ATM buffer system
This paper presents a VESI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in Asynchronous Transfer Mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in network...
متن کاملBeyond CHOKe: Stateless Fair Queueing
Making drop decisions to enforce the max-min fair resource allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index l (MLC(l)). We show analytically, using a Markov chain model, that for...
متن کاملApproximating Fair Queueing on Reconfigurable Switches
Congestion control today is predominantly achieved via end-to-end mechanisms with little support from the network. As a result, end-hosts must cooperate to achieve optimal throughput and fairness, leading to inefficiencies and poor performance isolation. While router mechanisms such as Fair Queuing guarantee fair bandwidth allocation to all participants and have proven to be optimal in some res...
متن کاملWireless packet scheduling in an integrated CDMA system using channel status information
A Fair Queueing Algorithm is proposed for data services in an integrated voice/data CDMA system. After delay-sensitive voice users are allocated first, then residual resources are allocated to data users according to the throughput maximization strategy. In order to fairly allocate data users, we use power resource concept which considers the BER and the rate requirement of data users, and appl...
متن کامل